A class of replacement systems with simple optimality theory

On the Simple Inverse Sampling with Replacement

In this paper we derive some unbiased estimators of the population mean under simple inverse sampling with replacement, using the class of Hansen-Hurwitz and Horvitz-Thompson type estimators and the post-stratification approach. We also compare the efficiency of resulting estimators together with Murthy's estimator. We show that in despite of general belief, the strategy consisting of inverse s...

OT SIMPLE - a construction-kit approach to Optimality Theory implementation

This paper details a simple approach to the implementation of Optimality Theory (OT, Prince and Smolensky 1993) on a computer, in part reusing standard system software. In a nutshell, OT’s GENerating source is implemented as a BinProlog program interpreting a context-free specification of a GEN structural grammar according to a user-supplied input form. The resulting set of textually flattened ...

1 A Simple Proof that Optimality Theory is Computationally Intractable

Adapting arguments from Eisner (1997, 2000), this remark provides a simple proof that the generation problem for Optimality Theory (OT, Prince and Smolensky 2004) is NP-hard. The proof needs only the binary evaluation of constraints and uses only constraints generally employed in the OT literature. In contrast, rule-based derivational systems are easily computable, belonging to the class of pol...

Numerical Solutions of Special Class of Systems of Non-Linear Volterra Integro-Differential Equations by a Simple High Accuracy Method

Optimality Theory and Arawan Prosodic Systems